System Description: SPASS-FD

نویسنده

  • Matthias Horbach
چکیده

Using a constrained superposition calculus and a disunification procedure, it is possible to employ superposition-based first-order reasoners for reasoning not only about all models of a first-order theory, but also about all models over a specific finite domain and often as well about the perfect models of the theory (or the unique minimal model in case of a Horn theory), both of which are second-order problems. In this paper, I describe the tool Spass-FD, an extension of the firstorder prover Spass that equips Spass with disunification and with fixed domain and minimal model theorem proving capabilities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

System Description: SpassVersion 3.0

Spass is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent developments in Spass 3.0, including support for dynamic modal logics, relational logics and expressive description logics, additional renaming and selection strategies, and significant interface enhancements for human and...

متن کامل

SPASS Version 3 . 5 Christoph Weidenbach

SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent developments in SPASS 3.5 including subterm contextual rewriting, improved split backtracking, a significantly faster FLOTTER implementation with additional control flags, completely symmetric implementation of forward and...

متن کامل

SPASS & FLOTTER Version 0.42

System Description FLOTTER 1 and SPASS 2 are a clause normal form translator for rst-order logic and a theorem prover for rst-order logic with equality, respectively. The algorithm implemented by FLOTTER includes an improved form of the renaming technique developed by Thierry Boy de la Tour 2], the optimized Skolemization technique by Ohlbach and Weidenbach 7] and some improvements leading to s...

متن کامل

MSPASS: Subsumption Testing with SPASS

mspass is an enhancement of the rst-order theorem prover spass 17; 18; 19; 20] with a translator of modal formulae, formulae of description logics, and formulae of the relational calculus into rst-order logic with equality. spass is one of the fastest and most sophisticated existing rst-order theorem provers and its performance compares well with special purpose theorem provers for modal logics...

متن کامل

LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)

LEO-II is a standalone, resolution-based higher-order theorem prover designed for effective cooperation with specialist provers for natural fragments of higher-order logic. At present LEO-II can cooperate with the first-order automated theorem provers E, SPASS, and Vampire. The improved performance of LEO-II, especially in comparison to its predecessor LEO, is due to several novel features incl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011